Coercions in a polymorphic type system
نویسنده
چکیده
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The traditional type system with let-polymorphism is extended with argument coercions and function coercions, and a corresponding type inference algorithm is presented and proved to be sound and complete.
منابع مشابه
Extending System Fη with Abstraction over Erasable Coercions
Erasable coercions in System Fη , also known as retyping functions, are well-typed η-expansions of the identity. They may change the type of terms without changing their behavior and can thus be erased before reduction. Coercions in Fη can model subtyping of known types and some displacement of quantifiers, but not subtyping assumptions nor certain form of delayed type instantiation. We general...
متن کاملRepresentation Analysis for Coercion Placement
This paper presents a global approach to representation analysis based on program-wide data and control ow information. Boxing and unboxing coercions can be placed around any variable occurrence, not only where values are produced and consumed. The analysis rst constructs a graph representing all legal coercion placements , then selects one of them. Assigning unboxed representations to as many ...
متن کاملExtending System Fη with Abstraction over Erasable Coercions
Erasable coercions in System Fη, also known as retyping functions, are well-typed η-expansions of the identity. They may change the type of terms without changing their behavior and can thus be erased before reduction. Coercions in Fη can model subtyping of known types and some displacement of quanti ers, but not subtyping assumptions nor certain form of delayed type instantiation. We generaliz...
متن کاملExplicit Effect Subtyping (Extended Version)
As popularity of algebraic effects and handlers increases, so does a demand for their efficient execution. Eff, an ML-like language with native support for handlers, has a subtyping-based effect system on which an effect-aware optimizing compiler could be built. Unfortunately, in our experience, implementing optimizations for Eff is overly error-prone because its core language is implicitly-typ...
متن کاملPolymorphic Dynamic Typing
We study dynamic typing in continuation of Henglein’s dynamically typed λ-calculus, with particular regard to proof theoretic aspects and aspects of polymorphic completion inference. Dynamically typed λ-calculus provides a formal framework within which we can reason in a precise manner about properties of the process of completion for higher order programming languages. Completions arise from r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 18 شماره
صفحات -
تاریخ انتشار 2008